Probabilistically-Atomic 2-Atomicity: Enabling Almost Strong Consistency in Distributed Storage Systems
نویسندگان
چکیده
منابع مشابه
Almost Strong Consistency: "Good Enough" in Distributed Storage Systems
A consistency/latency tradeoff arises as soon as a distributed storage system replicates data. For low latency, modern storage systems often settle for weak consistency conditions, which provide little, or even worse, no guarantee for data consistency. In this paper we propose the notion of almost strong consistency as a better balance option for the consistency/latency tradeoff. It provides bo...
متن کاملProbabilistically Secure Cooperative Distributed Storage
The trend towards self-organization of systems like peer-to-peer or mobile ad hoc networks generates increasing needs for distributed data management, in particular data backup and distributed storage functions that will themselves be self-organized and cooperative. Unfortunately, in such systems, the data stored are exposed to the selfishness (e.g. data discarded because of lack of resources) ...
متن کاملAtomic Systems in 2-inner Product Spaces
In this paper, we introduce the concept of family of local atoms in a 2-inner product space and then this concept is generalized to an atomic system. Besides, a characterization of an atomic system lead to obtain a new frame. Actually this frame is a generalization of previous works.
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملA Consistency in Non-Transactional Distributed Storage Systems
executions. We model system executions using the concept of abstract execution, following Burckhardt [2014]. An abstract execution is a multi-graphA = (H, vis, ar) built on a given history H, which it complements with two relations on elements of H, i.e., vis and ar. Whereas histories describe the observable outcomes of executions, vis and ar, intuitively, capture the non-determinism of the asy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2017
ISSN: 0018-9340
DOI: 10.1109/tc.2016.2601322